Intradimensional Single-Peakedness and the Multidimensional Arrow Problem

نویسنده

  • Christian List
چکیده

Arrow's account (1951/1963) of the problem of social choice is based upon the assumption that the preferences of each individual in the relevant group are expressible by a single ordering. This paper lifts that assumption and develops a multidimensional generalization of Arrow's framework. I show that, like Arrow's original framework, the multidimensional generalization is affected by an impossibility theorem, highlighting not only the threat of dictatorship of a single individual, but also the threat of dominance of a single dimension. In particular, even if preferences are single-peaked across individuals within each dimension -a situation called intradimensional single-peakedness -any aggregation procedure satisfying Arrow-type conditions will make one dimension dominant. I introduce lexicographic hierarchies of dimensions as a class of possible aggregation procedures under intradimensional single-peakedness. The interpretation of the results is discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Single-Peaked Width and Proportional Representation

This paper is devoted to the proportional representation (PR) problem when the preferences are clustered single-peaked. PR is a “multi-winner” election problem, that we study in Chamberlin and Courant’s scheme [6]. We define clustered single-peakedness as a form of single-peakedness with respect to clusters of candidates, i.e. subsets of candidates that are consecutive (in arbitrary order) in t...

متن کامل

Single-Peaked Consistency for Weak Orders Is Easy

In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is not always comprised of total orders. Often voters have indifference between some of the candidates. In a weak preference order indifference must be transit...

متن کامل

A Novel Algorithm for Mining Hybrid-Dimensional Association Rules

The important issue for association rules generation is the discovery of frequent itemset in data mining. Most of the existing real time transactional databases are multidimensional in nature. The classical Apriori algorithm mainly concerned with handling single level, single-dimensional boolean association rules. These algorithms scan the transactional databases or datasets many times to find ...

متن کامل

A Novel Algorithm for Mining Hybrid-Dimensional Association Rules

The important issue for association rules generation is the discovery of frequent itemset in data mining. Most of the existing real time transactional databases are multidimensional in nature. The classical Apriori algorithm mainly concerned with handling single level, single-dimensional boolean association rules. These algorithms scan the transactional databases or datasets many times to find ...

متن کامل

The Geometry of Black’s Single Peakedness and Related Conditions

“Black single peakedness” is a widely used restriction imposed on profiles. By using geometry to analyze all possible three candidate profiles satisfying this constraint, we discover that it allows subtle and disturbing election behavior. The same analysis is applied to the related profile constraints where some candidate never is top-ranked and some candidate never is bottom ranked.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002